Risk bounds for quantile trend filtering
نویسندگان
چکیده
Summary We study quantile trend filtering, a recently proposed method for nonparametric regression, with the goal of generalizing existing risk bounds usual trend-filtering estimators that perform mean regression. both penalized and constrained versions, order $r \geqslant 1$, univariate filtering. Our results show versions 1$ attain minimax rate up to logarithmic factors, when $(r-1)$th discrete derivative true vector quantiles belongs class bounded-variation signals. Moreover, we if is spline few polynomial pieces, then near-parametric convergence. Corresponding are known hold only errors sub-Gaussian. In contrast, our shown under minimal assumptions on error variables. particular, no moment needed heavy-tailed errors. proof techniques general, thus can potentially be used other regression methods. To illustrate this generality, employ obtain new multivariate total-variation denoising high-dimensional linear
منابع مشابه
Probabilistic Error Bounds for Simulation Quantile Estimators
Quantile estimation has become increasingly important, particularly in the financial industry, where value at risk (VaR) has emerged as a standard measurement tool for controlling portfolio risk. In this paper, we analyze the probability that a simulation-based quantile estimator fails to lie in a prespecified neighborhood of the true quantile. First, we show that this error probability converg...
متن کاملQuantile Matrix Factorization for Collaborative Filtering
Matrix Factorization-based algorithms are among the state-of-the-art in Collaborative Filtering methods. In many of these models, a least squares loss functional is implicitly or explicitly minimized and thus the resulting estimates correspond to the conditional mean of the potential rating a user might give to an item. However they do not provide any information on the uncertainty and the conf...
متن کاملl1 Trend Filtering
The problem of estimating underlying trends in time series data arises in a variety of disciplines. In this paper we propose a variation on Hodrick-Prescott (H-P) filtering, a widely used method for trend estimation. The proposed l1 trend filtering method substitutes a sum of absolute values (i.e., an l1-norm) for the sum of squares used in H-P filtering to penalize variations in the estimated ...
متن کامل1 Trend Filtering
The problem of estimating underlying trends in time series data arises in a variety of disciplines. In this paper we propose a variation on Hodrick–Prescott (H-P) filtering, a widely used method for trend estimation. The proposed !1 trend filtering method substitutes a sum of absolute values (i.e., !1 norm) for the sum of squares used in H-P filtering to penalize variations in the estimated tre...
متن کاملTrend Filtering on Graphs
Yu-Xiang Wang1,2 [email protected] James Sharpnack3 [email protected] Alexander J. Smola1,4 [email protected] Ryan J. Tibshirani1,2 [email protected] 1 Machine Learning Department, Carnegie Mellon University, Pittsburgh, PA 15213 2 Department of Statistics, Carnegie Mellon University, Pittsburgh, PA 15213 3 Mathematics Department, University of California at San Diego, La Jolla, CA 10280 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biometrika
سال: 2021
ISSN: ['0006-3444', '1464-3510']
DOI: https://doi.org/10.1093/biomet/asab045